P-225 Trustworthy AI algorithm for embryo ranking

نویسندگان

چکیده

Abstract Study question Deep-learning algorithms are known to be non-robust: can the variability and inconsistency of AI reduced in embryo selection? Summary answer We (measured on different tasks like rotations brightness changes) by 86% while preserving their quality. What is already methods generally non-robust, i.e., decisions change with even slight modification input data. Current solutions for scoring not robust - example rotating image results a score most market. Despite this fact expressed concerns embryologists, there no other publications focusing problem variance used IVF. Most measure accuracy, sensitivity, specificity, ROC AUC; metrics. design, size, duration The data-set was collected within multiple clinics using various devices. It contains 34,821 embryos (4,510 were transferred pregnancy results), represented time-lapse videos or images. This gives 3,290,481 frames at maturity levels. From 925 randomly selected chosen as test set. modified that supposed algorithm. measured scores given our Participants/materials, setting, have considered seven modifications images should influence scoring: • Rotations (10 angles); Brightness Contrast modifications; Substitutions Frames (from monitoring taken from 2 hours interval); Blur (Generalised Normal filter); Gaussian Noise; Blur; Sharpening. several techniques reduce deep neural network model (architecture commonly selection): Ensemble (of models cross validation); Test time augmentation (TTA); Robust training. Main role chance In order we following method. First, stretched standard uniform distribution. words look which percentile lies. way range normalised thus compared. Second, train EMBROAID augmented data includes all above modifications. Third, compute mean dropped (0.0055 0.0008) across individual drops modifications: Rotations: 77% (0.009 -> 0.002), Contrast: 81% (0.0036 0.0007), Substitution Frames: 76% (0.0076 0.0019), 94% (0.012 0.0008), Noise: 96% (0.0049 0.0002), Blur: 95% (0.0052 0.0003), Sharpening: (0.0015 0.0003). significance tested Wilcoxon Rank Sum giving p-value < 0.01 Finally, stress these obtained without any loss AUC metric. algorithm both original test-set. Both achieved an 0.66 (CI 0.63-0.69) test-sets. Limitations, reasons caution Further work needs done extend set possible augmentations Wider implications findings Increased reliability selection. obtain consistent over wide Trial registration number applicable

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trustworthy Route formation Algorithm for WSNs

This paper introduces a new algorithm for the formation of trustworthy route from source node to Base Station (BS) for secure routing of messages in Wireless Sensor Networks (WSNs). This algorithm process the information given by the Trust dependent Link State Routing Protocol which is improved version of our Routing Protocol presented in [1] Direct Trust dependent Link State Routing Protocol b...

متن کامل

Fast Feature Ranking Algorithm

The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simpler and easy to understand. The algorithm has some interesting characteristics: lower computational cost (O(m n log n) m attributes and n examples in the data set) with respect to other typical algorithms due to the abse...

متن کامل

Algorithm Selection via Ranking

The abundance of algorithms developed to solve different problems has given rise to an important research question: How do we choose the best algorithm for a given problem? Known as algorithm selection, this issue has been prevailing in many domains, as no single algorithm can perform best on all problem instances. Traditional algorithm selection and portfolio construction methods typically tre...

متن کامل

A Ranking Algorithm for Re-finding

Re-finding files from a personal computer is a frequent demand to users. When encountered a difficult re-finding task, people may not recall the attributes used by conventional refinding methods, such as a file’s path, file name, keywords etc., the re-finding would fail. We proposed a method to support difficult re-finding tasks. By asking the user a list of questions about the target, such as ...

متن کامل

FolkRank : A Ranking Algorithm for Folksonomies

In social bookmark tools users are setting up lightweight conceptual structures called folksonomies. Currently, the information retrieval support is limited. We present a formal model and a new search algorithm for folksonomies, called FolkRank, that exploits the structure of the folksonomy. The proposed algorithm is also applied to find communities within the folksonomy and is used to structur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Human Reproduction

سال: 2023

ISSN: ['1460-2350', '0268-1161']

DOI: https://doi.org/10.1093/humrep/dead093.583